Fault Diagnosis in Wireless Sensor Network using Timed Automata

An important problem in distributed systems that are subject to component failures is the distributed diagnosis problem. In distributed diagnosis, each working node must maintain correct information about the status (working or failed) of each component in the system. In this paper we consider the problem of identifying faulty (crashed) nodes in a wireless sensor network and used timed automata for representation. A fault diagnosis protocol specifically designed for wireless sensor networks is introduced and analyzed using finite automata theory. The protocol is proved to be optimal and energy efficient under certain assumptions. In this paper, we propose a diagnosis algorithm on the basis of diagnosability definitions and theoretical studies developed for timed and hybrid automata. The proposed algorithm has been simulated by using MATLAB and the diagnosis parameters such as diagnosis latency and message complexity. General Terms Recognition, Security, Algorithms, sensor, automata, wireless sensor network, process monitoring, health monitoring, dynamic diagnosis, network model, unicast, multicast, δ-diagnosabolity, fault-dignosis, timed automata.